The ∂ Steepest Descent Method for Orthogonal Polynomials on the Real Line with Varying Weights

نویسنده

  • P. D. MILLER
چکیده

We obtain Plancherel-Rotach type asymptotics valid in all regions of the complex plane for orthogonal polynomials with varying weights of the form e−NV (x) on the real line, assuming that V has only two Lipschitz continuous derivatives and that the corresponding equilibrium measure has typical support properties. As an application we extend the universality class for bulk and edge asymptotics of eigenvalue statistics in unitary invariant Hermitian random matrix theory. Our methodology involves developing a new technique of asymptotic analysis for matrix Riemann-Hilbert problems with nonanalytic jump matrices suitable for analyzing such problems even near transition points where the solution changes from oscillatory to exponential behavior.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniform Asymptotics for Discrete Orthogonal Polynomials with Respect to Varying Exponential Weights on a Regular Infinite Lattice

Abstract. We consider the large-N asymptotics of a system of discrete orthogonal polynomials on an infinite regular lattice of mesh 1 N , with weight e , where V (x) is a real analytic function with sufficient growth at infinity. The proof is based on formulation of an interpolation problem for discrete orthogonal polynomials, which can be converted to a Riemann-Hilbert problem, and steepest de...

متن کامل

The ∂ Steepest Descent Method and the Asymptotic Behavior of Polynomials Orthogonal on the Unit Circle with Fixed and Exponentially Varying Nonanalytic Weights

Abstract. We develop a new asymptotic method for the analysis of matrix Riemann-Hilbert problems. Our method is a generalization of the steepest descent method first proposed by Deift and Zhou; however our method systematically handles jump matrices that need not be analytic. The essential technique is to introduce nonanalytic extensions of certain functions appearing in the jump matrix, and to...

متن کامل

The asymptotic behaviour of recurrence coefficients for orthogonal polynomials with varying exponential weights

We consider orthogonal polynomials {pn,N(x)}n=0 on the real line with respect to a weight w(x) = e (x) and in particular the asymptotic behaviour of the coefficients an,N and bn,N in the three term recurrence xπn,N (x) = πn+1,N (x)+bn,Nπn,N (x)+an,Nπn−1,N (x). For one-cut regular V we show, using the Deift-Zhou method of steepest descent for Riemann-Hilbert problems, that the diagonal recurrenc...

متن کامل

A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems

In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...

متن کامل

The Riemann – Hilbert approach to strong asymptotics for orthogonal polynomials on [ − 1 , 1 ]

We consider polynomials that are orthogonal on [−1, 1] with respect to a modified Jacobi weight (1− x)α(1 + x)βh(x), with α, β > −1 and h real analytic and stricly positive on [−1, 1]. We obtain full asymptotic expansions for the monic and orthonormal polynomials outside the interval [−1, 1], for the recurrence coefficients and for the leading coefficients of the orthonormal polynomials. We als...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008